Fast Algorithms for Solving RFPrLR Circulant Linear Systems
نویسندگان
چکیده
In this paper, fast algorithms for solving RFPrLR circulant linear systems are presented by the fast algorithm for computing polynomials. The unique solution is obtained when the RFPrLR circulant matrix over the complex field C is nonsingular, and the special solution and general solution are obtained when the RFPrLR circulant matrix over the complex field C is singular. The extended algorithms is used to solve the RLPrFL circulant linear systems. Examples show the effectiveness of the algorithms. Key–Words: RFPrLR circulant matrix, Linear system, Fast algorithm.
منابع مشابه
A Method for Solving Hermitian Pentadiagonal Block Circulant Systems of Linear Equations
A new effective method and its two modifications for solving Hermitian pentadiagonal block circulant systems of linear equations are proposed. New algorithms based on the proposed method are constructed. Our algorithms are then compared with some classical techniques as far as implementation time is concerned, number of operations and storage. Numerical experiments corroborating the effectivene...
متن کاملCirculant Preconditioners for Solving Ordinary Differential Equations
In this paper, we consider the solution of ordinary diierential equations using boundary value methods. These methods require the solutions of one or more unsymmetric, large and sparse linear systems. Krylov subspace methods with the Strang block-circulant preconditioners are proposed for solving these linear systems. We prove that our preconditioners are invertible and all the eigenvalues of t...
متن کاملFast Algorithms for Solving the Inverse Problem of AX = b in the Class of the ULS r-Circulant (Retrocirculant) Matrices
In this paper, fast algorithms for solving the unique solution of the inverse problem of AX = b in the class of the ULS r-circulant(retrocirculant) matrices over a field F are given by the largest common factor of polynomial. Examples show the effectiveness of the algorithm. Mathematics Subject Classification: 15A29; 65F15
متن کاملA Parallel Algorithm for Circulant Tridiagonal Linear Systems
In this paper, based upon the divide-and-conquer strategy, we propose a parallel algorithm for solving the circulant tridiagonal systems, which is simpler than the two previous algorithms proposed by Agui and Jimenez ( 1995) and Chung et al. ( 1995). Our algorithm can be easily generalized to solve the tridiagonal systems, the block-tridiagonal systems, and the circulant block-tridiagonal syste...
متن کاملStrang-type Preconditioners for Solving Linear Systems from Neutral Delay Differential Equations
We study the solution of neutral delay differential equations (NDDEs) by using boundary value methods (BVMs). The BVMs require the solution of nonsymmetric, large and sparse linear systems. The GMRES method with the Strang-type block-circulant preconditioner is proposed to solve these linear systems. We show that if an Ak1,k2-stable BVM is used for solving an m-by-m system of NDDEs, then our pr...
متن کامل